A comment on scheduling on uniform machines under chain-type precedence constraints
نویسنده
چکیده
In a recent paper, Chekuri and Bender (Proceedings of IPCO’98, pp. 383–393) derive (among other results) a polynomial-time 6-approximation algorithm for makespan minimization on uniform parallel machines subject to chain-type precedence constraints. In this short note, we combine some straightforward observations and thereby derive an extremely simple 2-approximation algorithm for this problem. c © 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
Multi-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملUet-scheduling with Chain-type Precedence Constraints Uet|scheduling with Chain-type Precedence Constraints
x{ Scope and Purpose. | We consider a scheduling problem in a two-processor system where (i) every job can be processed on only one machine and where (ii) there are chain-type precedence relations among the jobs. The goal is to minimize the makespan. This continues the work of Chang and Lee 1], Jansen 4] and of Kellerer and Woeginger 5]. Abstract. | We consider a special case of the precedence ...
متن کاملSINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملApproximation Algorithms for Scheduling Jobs with Chain Precedence Constraints
The problem of scheduling jobs with precedence constraints is a central problem in Scheduling Theory which arises in many industrial and scientific applications. In this paper we present a polynomial time approximation scheme for the problem of scheduling jobs with chain precedence constraints on a fixed number of uniformly related machines. Our algorithm works even if we allow “slow” machines ...
متن کاملIntegrated Process Planning and Active Scheduling in a Supply Chain-A Learnable Architecture Approach
Through the lens of supply chain management, integrating process planning decisions and scheduling plans becomes an issue of great challenge and importance. Dealing with the problem paves the way to devising operation schedules with minimum makespan; considering the flexible process sequences, it can be viewed as a fundamental tool for achieving the scheme, too. To deal with this integration, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 26 شماره
صفحات -
تاریخ انتشار 2000